Fast transformations between configuration state function and Slater determinant bases for direct configuration interaction
نویسندگان
چکیده
منابع مشابه
Direct-list algorithm for configuration interaction calculations
We present a method for the direct generation of the lists of Ž . strings, suited for integral-driven full-CI FCI algorithms. This method generates the string lists each time they are used, and hence sensibly reduces the memory requirements, compared to our previous method that precalculates the lists. It was also extended to permit a truncation of the string space, according to the level of ex...
متن کاملTesting Configuration Knowledge-Bases
Writing tests for configuration knowledge-bases is a difficult task. One not minor reason is the huge search space. For exhaustive testing, all possible combinations of configuration parameters must be considered. In practice, exhaustive testing is thus often impossible, due to the sheer, exponential, number of combinations. Consequently it becomes necessary to focus on the most important confi...
متن کاملLinear response functions for a vibrational configuration interaction state.
Linear response functions are implemented for a vibrational configuration interaction state allowing accurate analytical calculations of pure vibrational contributions to dynamical polarizabilities. Sample calculations are presented for the pure vibrational contributions to the polarizabilities of water and formaldehyde. We discuss the convergence of the results with respect to various details ...
متن کاملConfiguration Interaction Methods
In this article configuration interaction methods of solving the Schrödinger eigenvalue problem are reviewed. In particular computational aspects of the "traditional" and of the direct approach are brief ly discussed. A special attention is given to the group-theory based formulations known as the unitary group approach and the symmetric group approach. Recent developments and implementations t...
متن کاملConsistency-Based Diagnosis of Configuration Knowledge Bases
Configuration problems are a thriving application area for declarative knowledge representation that currently experiences a constant increase in size and complexity of knowledge bases. Automated support of the debugging of such knowledge bases is a necessary prerequisite for effective development of configurators. We show that this task can be achieved by consistency-based diagnosis techniques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2020
ISSN: 0021-9606,1089-7690
DOI: 10.1063/5.0005155